On the m-Hull Number of the Join and Composition of Graphs

نویسنده

  • Esamel M. Paluga
چکیده

In this paper, the m-hull sets in the join and composition of two connected graphs are characterized and their m-hull numbers are shown to be direct consequences of these characterizations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS

In this paper we study the signed Roman dominationnumber of the join of graphs. Specially, we determine it for thejoin of cycles, wheels, fans and friendship graphs.

متن کامل

On the revised edge-Szeged index of graphs

The revised edge-Szeged index of a connected graph $G$ is defined as Sze*(G)=∑e=uv∊E(G)( (mu(e|G)+(m0(e|G)/2)(mv(e|G)+(m0(e|G)/2) ), where mu(e|G), mv(e|G) and m0(e|G) are, respectively, the number of edges of G lying closer to vertex u than to vertex v, the number of ed...

متن کامل

The locating chromatic number of the join of graphs

‎Let $f$ be a proper $k$-coloring of a connected graph $G$ and‎ ‎$Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into‎ ‎the resulting color classes‎. ‎For a vertex $v$ of $G$‎, ‎the color‎ ‎code of $v$ with respect to $Pi$ is defined to be the ordered‎ ‎$k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$‎, ‎where $d(v,V_i)=min{d(v,x):~xin V_i}‎, ‎1leq ileq k$‎. ‎If‎ ‎distinct...

متن کامل

m-polar intuitionistic graphs and its properties

In many real world problems, data sometimes comes from n agents (n≥2), multipolar information exists. For issues that are associated with uncertainty, this information can not be showed with the values of crisp, fuzzy, intuitionistic or bipolar. Graph is one of the mathematical models widely used in different sciences. Ambiguity in a graph where data depends on the n parameter can not be showed...

متن کامل

Normalized laplacian spectrum of two new types of join graphs

‎Let $G$ be a graph without an isolated vertex‎, ‎the normalized Laplacian matrix $tilde{mathcal{L}}(G)$‎ ‎is defined as $tilde{mathcal{L}}(G)=mathcal{D}^{-frac{1}{2}}mathcal{L}(G)mathcal{D}^{-frac{1}{2}}$‎, where ‎$mathcal{D}$ ‎is a‎ diagonal matrix whose entries are degree of ‎vertices ‎‎of ‎$‎G‎$‎‎. ‎The eigenvalues of‎ $tilde{mathcal{L}}(G)$ are ‎called as ‎the ‎normalized Laplacian eigenva...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ars Comb.

دوره 106  شماره 

صفحات  -

تاریخ انتشار 2012